Ordered discrete and continuous Z-numbers
نویسندگان
چکیده
منابع مشابه
Z-Cognitive Map: An Integrated Cognitive Maps and Z-Numbers Approach under Cognitive Information
Usually, in real-world engineering problems, there are different types of uncertainties about the studied variables, which can be due to the specific variables under investigation or interaction between them. Fuzzy cognitive maps, which addresses the cause-effect relation between variables, is one of the most common models for better understanding of the problems, especially when the quantitati...
متن کاملZ*-numbers: Augmented Z-numbers for machine-subjectivity representation
Envisaging a futuristic environment of man–machine and machine–machine synergy, this article documents our research on the augmented Z-numbers, the Z∗-numbers, for machineperception encapsulation. The Z∗-numbers have been envisioned as operands of endogenous machine-mind processes underlying bespoke comprehension of the real world. Besides information-certainty, as in a Z-number, a Z∗-number in...
متن کاملOrdered Ramsey numbers
Given a labeled graph H with vertex set {1, 2, . . . , n}, the ordered Ramsey number r<(H) is the minimum N such that every two-coloring of the edges of the complete graph on {1, 2, . . . , N} contains a copy of H with vertices appearing in the same order as in H. The ordered Ramsey number of a labeled graph H is at least the Ramsey number r(H) and the two coincide for complete graphs. However,...
متن کاملDISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کاملRamsey numbers of ordered graphs
An ordered graph G< is a graph G with vertices ordered by the linear ordering <. The ordered Ramsey number R(G<, c) is the minimum number N such that every ordered complete graph with c-colored edges and at least N vertices contains a monochromatic copy of G<. For unordered graphs it is known that Ramsey numbers of graphs with degrees bounded by a constant are linear with respect to the number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaysian Journal of Fundamental and Applied Sciences
سال: 2020
ISSN: 2289-599X,2289-5981
DOI: 10.11113/mjfas.v16n4.1632